ECRB-Based Optimal Parameter Encoding Under Secrecy Constraints
نویسندگان
چکیده
منابع مشابه
Asymptotically Optimal Parameter Estimation under Communication Constraints
A parameter estimation problem is considered, in which dispersed sensors transmit to the statistician partial information regarding their observations. The sensors observe the paths of continuous semimartingales, whose drifts are linear with respect to a common parameter. A novel estimating scheme is suggested, according to which each sensor transmits only one-bit messages at stopping times of ...
متن کاملOptimal Power Allocation for Secrecy Fading Channels Under Spectrum-Sharing Constraints
In the spectrum-sharing technology, a secondary user may utilize the primary user’s licensed band as long as its interference to the primary user is below a tolerable value. In this paper, we consider a scenario in which a secondary user is operating in the presence of both a primary user and an eavesdropper. Hence, the secondary user has both interference limitations and security consideration...
متن کاملPerformance Trade-offs in IoT Uplink Networks under Secrecy Constraints
We investigate the performance of Internet-ofThings (IoT) networks under passive attacks from eavesdroppers capable of monitoring individual links. An IoT network with multiple sensor classes is studied where every sensor class has a local access point (LAP) which are connected to one or more small cell base-station access points (SAP) which in turn are connected to a central cloud access point...
متن کاملLow-SNR Analysis of Interference Channels under Secrecy Constraints
In this paper, we study the secrecy rates over weak Gaussian interference channels for different transmission schemes. We focus on the low-SNR regime and obtain the minimum bit energy Eb N0 min values, and the wideband slope regions for both TDMA and multiplexed transmission schemes. We show that secrecy constraints introduce a penalty in both the minimum bit energy and the slope regions. Addit...
متن کاملOptimal rounding under integer constraints
Given N real numbers whose sum is an integer, we study the problem of finding N integers which match these real numbers as closely as possible, in the sense of Lp norm, while preserving the sum. We describe the structure of solutions for this integer optimization problem and propose an algorithm with complexity O(N logN) for solving it. In contrast to fractional rounding and randomized rounding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2018
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2018.2833802